An Approach for Community Cutting

Informational networks and networks created based on social interactions possess high complexity. Yet the networks can be decoupled into sets of vertices, communities, more interconnected among each other then by other vertices of the network. For mining internal structure of informational and social networks approach for finding community around a seed of vertices is described. Most of existing clustering approaches intend to identify all communities in the network, our goal is to identify the community around a vertex or a set of vertices. We give also short overview of tools for network analysis and their functionalities is given.